New Short Signature Scheme with Weil Pairing
نویسندگان
چکیده
Short signature is an essential component in cryptography. Short digital signatures are needed in environments where a human is asked to manually key in the signature.. In this paper we propose a new short signature scheme with weil pairing. Also we analyze security and efficiency of our scheme. Security of our scheme is based on expressing the torsion point of curve into linear combination of its basis points; it is more complicated than solving ECDLP(Elliptic Curve Discrete Logarithm Problem). We claim that our new short signature scheme is more secure and efficient than the existing scheme of SedatAkleylek et al. based on bilinear pairing. General Terms 2000 AMS Subject Classification No. 94A60
منابع مشابه
Convertible limited (multi-) verifier signature: new constructions and applications
A convertible limited (multi-) verifier signature (CL(M)VS) provides controlled verifiability and preserves the privacy of the signer. Furthermore, limited verifier(s) can designate the signature to a third party or convert it into a publicly verifiable signature upon necessity. In this proposal, we first present a generic construction of convertible limited verifier signature (CLVS) into which...
متن کاملA Pairing-based Blind Signature Scheme with Message Recovery
Blind signatures enable users to obtain valid signatures for a message without revealing its content to the signer. This paper presents a new blind signature scheme, i.e. identity-based blind signature scheme with message recovery. Due to the message recovery property, the new scheme requires less bandwidth than the identitybased blind signatures with similar constructions. The scheme is based ...
متن کاملID-Based One Round Authenticated Tripartite Key Agreement Protocol with Pairings
With various applications of Weil pairing (Tate pairing) to cryptography, ID-based encryption schemes, digital signature schemes, blind signature scheme, two-party authenticated key agreement schemes, and tripartite key agreement scheme were proposed recently, all of them using bilinear pairing (Weil or Tate pairing). In this paper, we propose an ID-based one round authenticated tripartite key ...
متن کاملExponent Group Signature Schemes and Efficient Identity Based Signature Schemes Based on Pairings
We describe general exponent group signature schemes and show how these naturally give rise to identity based signature schemes if pairings are used. We prove these schemes to be secure in the random oracle model. Furthermore we describe a particular identity based signature scheme which is quite eecient in terms of bandwidth and computing time, and we develop a further scheme which is not deri...
متن کاملEfficient and Forward-Secure Identity-Based Signcryption
Several signcryption schemes proposed in the literature are known to lack semantic security, and semantically secure signcryption schemes tend to be more computationally expensive. In fact, devising an efficient signcryption scheme providing both public verifiability and forward security was until now an open problem. In this paper, we show how a particular kind of signcryption scheme may becom...
متن کامل